Gathering of Asynchronous Oblivious Robots with Limited Visibility
نویسندگان
چکیده
W e consid er a collection of rob ots wh ich are id entical (anonym ou s), h ave lim ited visib ility of th e environm ent, and no m em ory of th e p ast (ob liviou s); fu rth erm ore, th ey are totally asynch ronou s in th eir ac tions, com p u tations, and m ovem ents. W e sh ow th at, even in su ch a totally asynch ronou s setting , it is p ossib le for th e rob ots to g ath er in th e sam e location in fi nite tim e, p rovid ed th ey h ave a com p ass. K e y w o rd s: D istrib u ted alg orith m s, coord ination, control, m ob ile rob ots.
منابع مشابه
Gathering of asynchronous robots with limited visibility
In this paper we study the problem of gathering in the same location of the plane a collection of identical oblivious mobile robots. Previous investigations have focused mostly on the unlimited visibility setting, where each robot can always see all the other ones, regardless of their distance. In the more difficult and realistic setting where the robots have limited visibility, the existing al...
متن کاملEventually Consistent Compasses for Robust Gathering of Asynchronous Mobile Robots with Limited Visibility
Reaching agreement among a set of mobile robots is one of the most fundamental issues in distributed robotic systems. This problem is often illustrated by the gathering problem, where the robots must self-organize to eventually meet at some arbitrary location. That problem has the advantage that, while being very simple to express, it retains the inherent difficulty of agreement, namely the pro...
متن کاملUnreliable Compasses for Robust Gathering of Asynchronous Mobile Robots
Reaching agreement among a set of mobile robots so that they behave as a coherent system is one of the most fundamental issues in distributed robotic systems. This problem is often illustrated by the gathering problem, where the robots must self-organize to eventually meet at some arbitrary location. That problem has the advantage that, while being very simple to express, it retains the inheren...
متن کاملGetting Close without Touching
In this paper we study the Near-Gathering problem for a set of asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in LookCompute-Move (LCM) cycles: In this problem, the robots have to get close enough to each other, so that every robot can see all the others, without touching (i.e., colliding) with any other robot. The importance of this problem might...
متن کاملRoboCast: Asynchronous Communication in Robot Networks
This paper introduces the RoboCast communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors and do not share a common coordinate system, to asynchronously exchange information. We propose a generic framework that covers a large class of asynchronous communication algorithms and show how our framework can be used to i...
متن کاملGathering Asynchronous Mobile Robots with Inaccurate Compasses
This paper considers a system of asynchronous autonomous mobile robots that can move freely in a two dimensional plane with no agreement on a common coordinate system. Startingfrom any initial configuration, the robots are required to eventually gather at a single point, notfixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001